Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
نویسندگان
چکیده
منابع مشابه
Computing Approximate Shortest Paths on Convex Polytopes1
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algorithm for computing approximate shortest paths on a convex polyhedral surface. Given a convex polyhedral surface P in R3, two points s, t ∈ P , and a parameter ε > 0, it computes a path between s and t on P whose lengt...
متن کاملA Landmark Algorithm for the Time-Dependent Shortest Path Problem
The shortest path problem is one of the most classical problem in combinatorial optimization problem which, given an edge-weighted graph and two vertices, asks to find a path between the two vertices of the minimum length. In this thesis, we consider a generalization of the shortest path problem in which the edge length is time-variable, which we call the time-dependent shortest path problem. T...
متن کاملApproximate Distance Oracles with Improved Query Time
Given an undirected graph G with m edges, n vertices, and non-negative edge weights, and given an integer k ≥ 2, we show that a (2k − 1)-approximate distance oracle for G of size O(kn) and with O(log k) query time can be constructed in O(min{kmn1/k, √ km+kn √ k}) time for some constant c. This improves the O(k) query time of Thorup and Zwick. Furthermore, for any 0 < ǫ ≤ 1, we give an oracle of...
متن کاملAll-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing
Given an undirected, unweighted graph G on n nodes, there is an O(n2poly logn)-time algorithm that computes a data structure called distance oracle of size O(n5/3poly logn) answering approximate distance queries in constant time. For nodes at distance d the distance estimate is between d and 2d+ 1. This new distance oracle improves upon the oracles of Pǎtraşcu and Roditty (FOCS 2010), Abraham a...
متن کاملTopCom: Index for Shortest Distance Query in Directed Graph
Finding shortest distance between two vertices in a graph is an important problem due to its numerous applications in diverse domains, including geo-spatial databases, social network analysis, and information retrieval. Classical algorithms (such as, Dijkstra) solve this problem in polynomial time, but these algorithms cannot provide real-time response for a large number of bursty queries on a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2014
ISSN: 1041-4347
DOI: 10.1109/tkde.2012.253